Voer een woord of zin in in een taal naar keuze 👆
Taal:
Vertaling en analyse van woorden door kunstmatige intelligentie
Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:
- hoe het woord wordt gebruikt
- gebruiksfrequentie
- het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
- opties voor woordvertaling
- Gebruiksvoorbeelden (meerdere zinnen met vertaling)
- etymologie
Wat (wie) is pseudorandom - definitie
Pseudorandomness
APPEARING RANDOM BUT ACTUALLY BEING GENERATED BY A DETERMINISTIC, CAUSAL PROCESS
Pseudo Random; Pseudo-random; Pseudo-random number; Pseudo random; Pseudorandom; Pseudo-randomness; Pseudorandom number; Pseudo-random sequence; Pseudo-random numbers; Pseudorandom data; Pseudorandom numbers; Pseudorandom encoders; Pseudorandom encoder; Pseudo-Randomisation; Psedorandom
A pseudorandom sequence of numbers is one that appears to be statistically random, despite having been produced by a completely deterministic and repeatable process.
pseudorandom number
APPEARING RANDOM BUT ACTUALLY BEING GENERATED BY A DETERMINISTIC, CAUSAL PROCESS
Pseudo Random; Pseudo-random; Pseudo-random number; Pseudo random; Pseudorandom; Pseudo-randomness; Pseudorandom number; Pseudo-random sequence; Pseudo-random numbers; Pseudorandom data; Pseudorandom numbers; Pseudorandom encoders; Pseudorandom encoder; Pseudo-Randomisation; Psedorandom
<programming> One of a sequence of numbers generated by some
algorithm so as to have an even distribution over some range
of values and minimal correlation between successive
values.
Pseudorandom numbers are used in simulation and
encryption. They are pseudorandom not random because the
sequence eventually repeats exactly and is entirely determined
by the initial conditions.
One of the simplest algorithms is
x[i+1 ] = (a * x[i ] + c) mod m
but this repeats after at most m numbers and successive
numbers are closely related. Better algorithms generally use
more previous numbers to calculate the next number.
http://random.mat.sbg.ac.at/.
(2007-06-29)
Pseudorandom generator
TERM
Pseudorandom generators
In theoretical computer science and cryptography, a pseudorandom generator (PRG) for a class of statistical tests is a deterministic procedure that maps a random seed to a longer pseudorandom string such that no statistical test in the class can distinguish between the output of the generator and the uniform distribution. The random seed itself is typically a short binary string drawn from the uniform distribution.
